Frameproof and IPP Codes
نویسندگان
چکیده
منابع مشابه
Two-Level Fingerprinting Codes: Non-Trivial Constructions
We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.
متن کاملSequential and dynamic frameproof codes
There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes and traitor-tracing schemes. The concept of traitor tracing has been applied to a digital broadcast setting in the form of dynamic traitor-tracing schemes and sequential traitor-tracing schemes, which could be used to combat piracy of pay-TV broadcasts,...
متن کاملOn symmetric designs and binary 3-frameproof codes
In this paper, we study when the incidence matrix of a symmetric (v, k, λ)-BIBD is a 3-frameproof code. We show the existence of infinite families of symmetric BIBDs that are 3-frameproof codes, as well as infinite families of symmetric BIBDs that are not 3-frameproof codes.
متن کاملDynamic frameproof codes
There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes, which prevent traitorous users from colluding to frame an innocent user, and traitortracing schemes, which enable the identification of users involved in piracy. The concept of traitor tracing has been applied to a digital broadcast setting in the form...
متن کاملCombinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper we investigate combinatorial properties and constructions of two recent topics of cryptographic interest namely frameproof codes for digital ngerprinting and traceability schemes for broadcast encryption We rst give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error correcting codes...
متن کامل